Independence equivalence classes of paths

The graph of equivalence classes and Isoclinism of groups

‎Let $G$ be a non-abelian group and let $Gamma(G)$ be the non-commuting graph of $G$‎. ‎In this paper we define an equivalence relation $sim$ on the set of $V(Gamma(G))=Gsetminus Z(G)$ by taking $xsim y$ if and only if $N(x)=N(y)$‎, ‎where $ N(x)={uin G | x textrm{ and } u textrm{ are adjacent in }Gamma(G)}$ is the open neighborhood of $x$ in $Gamma(G)$‎. ‎We introduce a new graph determined ...

Some equivalence classes of operators on B(H)

Equivalence Classes of Motzkin Paths Modulo a Pattern of Length at Most Two

For any pattern α of length at most two, we enumerate equivalence classes of Motzkin paths where two paths of the same length are equivalent whenever they coincide on all occurrences of the pattern α.

Fuzzy equivalence relations and their equivalence classes

In this paper we investigate various properties of equivalence classes of fuzzy equivalence relations over a complete residuated lattice. We give certain characterizations of fuzzy semipartitions and fuzzy partitions over a complete residuated lattice, as well as over a linearly ordered complete Heyting algebra. In the latter case, for a fuzzy equivalence relation over a linearly ordered comple...

Equivalence classes of future paths for sensor allocation and threat analysis [5913-36]

Sensor allocation and threat analysis are difficult fusion problem that can sometimes be approximately solved using simulations of the future movement of adversary units. In addition to requiring detailed motion models, such simulation also requires large amounts of computational resources, since a large number of possibilities must be examined. In this paper, we extend our previously introduce...